Strong bounds with cut and column generation for class-teacher timetabling
نویسندگان
چکیده
منابع مشابه
Strong bounds with cut and column generation for class-teacher timetabling
This work presents an integer programming formulation for a variant of the Class-Teacher Timetabling problem, which considers the satisfaction of teacher preferences and also the proper distribution of lessons throughout the week. The formulation contains a very large number of variables and is enhanced by cuts. Therefore, a cut and column generation algorithm to solve its linear relaxation is ...
متن کاملA Column Generation Scheme for Faculty Timetabling
In this paper we deal with the problem of building a timetable for the courses of a university faculty. We propose an integer linear programming approach based on column generation. Each column is associated to a weekly timetable of a single course. The constraints referring to classroom occupancy and non overlapping in time of courses are in the integer linear programming matrix. The constrain...
متن کاملA column generation approach for examination timetabling
In examination timetabling we have to assign the exams of a given set of courses to time slots, such that conflicting exams are assigned to different time slots. We study the problem that occurs at our department. The characteristics of this problem are as follows. The exams have to take place in 5 days, and per day there are 2 time slots. Teachers can express their preferences for the time slo...
متن کاملCut generation for an employee timetabling problem
Motivated by an industrial application, we study a specific employee timetabling problem. Several investigations are being conducted: a lower bound by Lagrangian relaxation, a heuristic based on a cut generation process and an exact method by Benders decomposition. Experimental results on real and generated instances are reported.
متن کاملInnovative Evolutionary Algorithm Approach for Class-Teacher Timetabling Problem
This paper presents the application of genetic algorithms (GAs) as a means of inducing solutions to the ClassTeacher Timetabling Problem (CTTP). Timetabling problem in almost all research focus on solving the hard constraints. This is an attempt to satisfy as many soft constraints as possible, as soft constraints are varying in nature. Initially the population is created depending on the number...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Operations Research
سال: 2010
ISSN: 0254-5330,1572-9338
DOI: 10.1007/s10479-010-0709-y